Canonical Formulas for Wk4
نویسندگان
چکیده
We generalize the theory of canonical formulas for K4 (the logic of transitive frames) to wK4 (the logic of weakly transitive frames). Our main result establishes that each logic over wK4 is axiomatizable by canonical formulas, thus generalizing Zakharyaschev’s theorem for logics over K4. The key new ingredients include the concepts of transitive and strongly cofinal subframes of weakly transitive spaces. This yields, along with the standard notions of subframe and cofinal subframe logics, the new notions of transitive subframe and strongly cofinal subframe logics over wK4. We obtain axiomatizations of all four kinds of subframe logics over wK4. We conclude by giving a number of examples of different kinds of subframe logics over wK4.
منابع مشابه
An Algebraic Approach to Subframe Logics. Modal Case
We prove that if a modal formula is refuted on a wK4-algebra (B, ), then it is refuted on a finite wK4-algebra which is isomorphic to a subalgebra of a relativization of (B, ). As an immediate consequence, we obtain that each subframe and cofinal subframe logic over wK4 has the finite model property. On the one hand, this provides a purely algebraic proof of the results of Fine and Zakharyasche...
متن کاملCANONICAL FORMULAS FOR k-POTENT COMMUTATIVE, INTEGRAL, RESIDUATED LATTICES
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Indeed, they provide a uniform and semantic way of axiomatising all extensions of intuitionistic logic and all modal logics above K4. Although the method originally hinged on the relational semantics of those logics, recently it has been completely recast in algebraic terms. In this new perspective canonical fo...
متن کاملCanonical formulas via locally finite reducts and generalized dualities
Axiomatizability, the finite model property (FMP), and decidability are some of the most frequently studied properties of non-classical logics. One of the first general methods of axiomatizing large classes of superintuitionistic logics (si-logics for short) was developed by Jankov [8]. For each finite subdirectly irreducible Heyting algebra A, Jankov designed a formula that encodes the structu...
متن کاملLocally Finite Reducts of Heyting Algebras and Canonical Formulas
The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the→-free reducts of Heyting algebras while the variety of implicative semilattices by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that ge...
متن کاملCofinal Stable Logics
We generalize the (∧,∨)-canonical formulas of [3] to (∧,∨)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by (∧,∨)-canonical rules. This provides an intuitionistic analogue of [6], and is an alternative of [19]. It also yields a convenient characterization of stable superintuitionistic logics introduced in [3]. The (∧,∨)-canonical form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Rew. Symb. Logic
دوره 5 شماره
صفحات -
تاریخ انتشار 2012